Straightest Paths on Meshes by Cutting Planes
نویسندگان
چکیده
Geodesic paths and distances on meshes are used for many applications such as parameterization, remeshing, mesh segmentation, and simulations of natural phenomena. Noble works to compute shortest geodesic paths have been published. In this paper, we present a new approach to compute the straightest path from a source to one or more vertices on a manifold mesh with a boundary. A cutting plane with a source and a destination vertex is first defined. Then the straightest path between these two vertices is created by intersecting the cutting plane with faces on the mesh. We demonstrate that our straightest path algorithm contributes to reducing distortion in a shape-preserving linear parameterization by generating a measured boundary.
منابع مشابه
Parameterization of 3D Surface Patches by Straightest Distances
In this paper, we introduce a new piecewise linear parameterization of 3D surface patches which provides a basis for texture mapping, morphing, remeshing, and geometry imaging. To lower distortion when flatting a 3D surface patch, we propose a new method to locally calculate straightest distances with cutting planes. Our new and simple technique demonstrates competitive results to the current l...
متن کاملInteractive Cutting of Thin Deformable Objects
Simulation of cutting is essential for many applications such as virtual surgical training. Most existing methods use the same triangle mesh for both visualization and collision handling, although the requirements for them in the interactive simulation are different. We introduce visual-collision binding between high-resolution visual meshes and low-resolution collision meshes, and thus extend ...
متن کامل3D Reconstruction from Sparse Unorganized Cross Sections
In this thesis work, we propose an algorithm for smooth 3D object reconstruction from unorganized planar cross sections. We address the problem in its full generality, and show its effectiveness on sparse set of cutting planes. Our algorithm is based on construction of a globally consistent signed distance function over the cutting planes. It uses a divide-and-conquer approach utilizing Hermite...
متن کامل3D Surface Reconstruction from Unorganized Sparse Cross Sections
In this paper, we propose an algorithm for closed and smooth 3D surface reconstruction from unorganized planar cross sections. We address the problem in its full generality, and show its effectiveness on sparse set of cutting planes. Our algorithm is based on the construction of a globally consistent signed distance function over the cutting planes. It uses a split-and-merge approach utilising ...
متن کاملSubdivision Curves on Triangular Meshes
Subdivision curves have great importance for many CAD/CAM applications. In this paper we propose a simple method to define subdivision schemes on triangulations. It works by translating to the triangulation a perturbation of a planar binary subdivision. To reproduce this perturbation in the surface we use both, shortest and straightest geodesics, so we call this strategy intrinsic projection me...
متن کامل